Focusing on Least Cardinality Diagnoses

نویسنده

  • Aldo Franco Dragoni
چکیده

The main problem with Model-Based Diagnosis is its computational complexity. Each of its fundamental steps, prediction, conflict recognition and candidate generation, exhibits a combinatorial explosion for large devices. The algorithm we present generates diagnoses in an incremental way, starting from all those with the same least cardinality. Provided the reliability of the system’s components, the probability of a diagnosis should decrease with its cardinality. Anytime we’d stop the algorithm we’d had already generated some of the more probable diagnoses for the faulty system. Generating least cardinality diagnoses is much less expensive than generating all the minimal diagnoses, even because we can adopt very efficient Operational Research techniques. Moreover, we show that least cardinality diagnoses are the only ones we have to know for determining the best point in which to make a further measurement in order to reduce the conflict sets number.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel SAT-Based Approach to Model Based Diagnosis

This paper introduces a novel encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and the application of a SAT compiler which optimizes the encoding to provide more succinct CNF representations than obtained with previous works. Experimental evidence ...

متن کامل

Compiling Model-Based Diagnosis to Boolean Satisfaction

This paper introduces an encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and SAT compilation techniques which together provide concise CNF formula. Experimental evidence indicates that our approach is superior to all published algorithms for minim...

متن کامل

Distributed Diagnosis by using a Condensed Local Representation of the Global Diagnoses with Minimal Cardinality

The set of diagnoses is commonly calculated in consistency based diagnosis, where a diagnosis includes a set of faulty components. In some applications, the search for diagnoses is reduced to the set of diagnoses with minimal cardinality. In distributed systems, local diagnoses are calculated in each agent, and global diagnoses are calculated for the complete system. The key contribution in the...

متن کامل

Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses

Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observation α. However, for different α there may be minimal-cardinality diagnoses of differing cardinalities, and several applications (such as test pattern generation and benchmark model analysis) need to identify the α lea...

متن کامل

Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses

Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observation α. However, for different α there may be minimal-cardinality diagnoses of differing cardinalities, and several applications (such as test pattern generation and benchmark model analysis) need to identify the α lea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007